Broad-band Oscillations by Probabilistic Cellular Automata
نویسندگان
چکیده
Electroencephalographic and magnetoencephalographic potential generated by active brain reveals widespread coherent oscillations. The oscillations of multiple rhythms overlap in broad spectrum noise. Spectrum analysis of short segments reveals peaks in various frequency ranges. As the duration of segments chosen for analysis increases, the basic form to which spectra converge is the one of Brown noise. Any frequency can be modeled with probabilistic cellular automata. Coupled inhibitory and excitatory probabilistic cellular automata with appropriate topology and probabilistic rule governing the local interactions simulate an oscillator. Coupled oscillators create a model with the activation whose spectrum of long segments converges to a Brown noise.
منابع مشابه
Narrow-band oscillations in probabilistic cellular automata.
Dynamical properties of neural populations are studied using probabilistic cellular automata. Previous work demonstrated the emergence of critical behavior as the function of system noise and density of long-range axonal connections. Finite-size scaling theory identified critical properties, which were consistent with properties of a weak Ising universality class. The present work extends the s...
متن کاملRandom graph theory and neuropercolation for modeling brain oscillations at criticality.
Mathematical approaches are reviewed to interpret intermittent singular space-time dynamics observed in brain imaging experiments. The following aspects of brain dynamics are considered: nonlinear dynamics (chaos), phase transitions, and criticality. Probabilistic cellular automata and random graph models are described, which develop equations for the probability distributions of macroscopic st...
متن کاملWhen are cellular automata random ?
A cellular automaton is a collection of cells, each of which is in one of a finite number of states. The cells’ states are updated according to some local rules which take into account the state of the cell and the states of its neighbours. For instance: a two dimensional grid with two states per cell is used in Conway’s Game of Life in which each cell is alive or dead and transition rules are ...
متن کاملComputing with Probabilistic Cellular Automata
We investigate the computational capabilities of probabilistic cellular automata by means of the density classification problem. We find that a specific probabilistic cellular automata rule is able to solve the density classification problem, i.e. classifies binary input strings according to the number of 1’s and 0’s in the string, and show that its computational abilities are related to critic...
متن کاملLarge Deviations for Probabilistic Cellular Automata
We consider a generalized model of a probabilistic cellular automata described by a Markov chain on an infinite dimensional space and derive certain large deviations bounds for corresponding occupational measures.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- J. Cellular Automata
دوره 5 شماره
صفحات -
تاریخ انتشار 2010